Optimization Bounds from the Branching Dual
نویسندگان
چکیده
Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print or online or to submit the papers to another publication.
منابع مشابه
Improving strong branching by domain propagation
One of the essential components of a branch-and-bound based mixed-integer linear programming (MIP) solver is the branching rule. Strong branching is a method used by many state-of-the-art branching rules to select the variable to branch on. It precomputes the dual bounds of potential child nodes by solving auxiliary linear programs (LPs) and thereby helps to take good branching decisions that l...
متن کاملNew Formulations and Branching Strategies for the Gop Algorithm
In Floudas and Visweswaran (1990, 1993), a deterministic global optimization approach was proposed for solving certain classes of nonconvex optimization problems. A global optimization algorithm, GOP, was presented for the solution of the problem through a series of primal and relaxed dual problems that provide valid upper and lower bounds respectively on the global solution. The algorithm was ...
متن کاملSet covering algorithms using cutting planes, heuristics, and subgradient optimization : a computational study
We report on the implementation and computational testing of several versions of a set covering algorithm, based on the family of cutting planes from conditional bounds discussed in the companion paper [2]. The algorithm uses a set of heuristics to find prime covers, another set of heuristics to find feasible solutions to the dual linear program which are needed to generate cuts, and subgradien...
متن کاملSurrogate Branching: Parametric Relaxation for Mixed Integer Optimization
Surrogate Branching (SB) methods in mixed integer optimization provide a staged parametric relaxation of customary branching methods used in branch-and-bound and branch-and-cut algorithms. SB methods operate by forming surrogate constraints composed of non-negative linear combinations of component inequalities of three types: (1) ordinary branching inequalities, (2) redundant inequalities invol...
متن کاملImproving Strong Branching by Propagation
Strong branching is an important component of most variable selection rules in branchand-bound based mixed-integer linear programming solvers. It predicts the dual bounds of potential child nodes by solving auxiliary LPs and thereby helps to keep the branchand-bound tree small. In this paper, we describe how these dual bound predictions can be improved by including domain propagation into stron...
متن کامل